[INFO] cloning repository https://github.com/hunterlester/rusty_algo_structs
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/hunterlester/rusty_algo_structs" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fhunterlester%2Frusty_algo_structs", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fhunterlester%2Frusty_algo_structs'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 5f421d0712e9f3f331c12c9b41152ad4561c7c4e
[INFO] checking hunterlester/rusty_algo_structs against try#72f88fc4e9458f89516a0b8b0868f3718aec5b47 for pr-74989
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fhunterlester%2Frusty_algo_structs" "/workspace/builds/worker-14/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-14/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/hunterlester/rusty_algo_structs on toolchain 72f88fc4e9458f89516a0b8b0868f3718aec5b47
[INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+72f88fc4e9458f89516a0b8b0868f3718aec5b47" "read-manifest" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/hunterlester/rusty_algo_structs
[INFO] finished tweaking git repo https://github.com/hunterlester/rusty_algo_structs
[INFO] tweaked toml for git repo https://github.com/hunterlester/rusty_algo_structs written to /workspace/builds/worker-14/source/Cargo.toml
[INFO] crate git repo https://github.com/hunterlester/rusty_algo_structs already has a lockfile, it will not be regenerated
[INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+72f88fc4e9458f89516a0b8b0868f3718aec5b47" "fetch" "--locked" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-14/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-14/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "rustops/crates-build-env@sha256:d92eaeed33fa75130ca1ee6c8a01d1ffb62bac859dfdfb3450e3e5d1c0146529" "/opt/rustwide/cargo-home/bin/cargo" "+72f88fc4e9458f89516a0b8b0868f3718aec5b47" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 247a88ce5fdcec883ca1e1836a6adb6f15895018013a6f94d593b8d70c127bb4
[INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap.
[INFO] running `Command { std: "docker" "start" "-a" "247a88ce5fdcec883ca1e1836a6adb6f15895018013a6f94d593b8d70c127bb4", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "247a88ce5fdcec883ca1e1836a6adb6f15895018013a6f94d593b8d70c127bb4", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "247a88ce5fdcec883ca1e1836a6adb6f15895018013a6f94d593b8d70c127bb4", kill_on_drop: false }`
[INFO] [stdout] 247a88ce5fdcec883ca1e1836a6adb6f15895018013a6f94d593b8d70c127bb4
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-14/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-14/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "rustops/crates-build-env@sha256:d92eaeed33fa75130ca1ee6c8a01d1ffb62bac859dfdfb3450e3e5d1c0146529" "/opt/rustwide/cargo-home/bin/cargo" "+72f88fc4e9458f89516a0b8b0868f3718aec5b47" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] dd21c35bc833e7fb2aaa5e3fd2117a4a68229ffe7760ed7675db2e5b6450114c
[INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap.
[INFO] running `Command { std: "docker" "start" "-a" "dd21c35bc833e7fb2aaa5e3fd2117a4a68229ffe7760ed7675db2e5b6450114c", kill_on_drop: false }`
[INFO] [stderr]    Compiling semver-parser v0.7.0
[INFO] [stderr]     Checking lazy_static v1.4.0
[INFO] [stderr]     Checking cfg-if v0.1.10
[INFO] [stderr]    Compiling maybe-uninit v2.0.0
[INFO] [stderr]    Compiling byteorder v1.3.4
[INFO] [stderr]    Compiling unicode-xid v0.2.0
[INFO] [stderr]    Compiling syn v1.0.16
[INFO] [stderr]    Compiling bitflags v1.2.1
[INFO] [stderr]     Checking unicode-width v0.1.7
[INFO] [stderr]     Checking regex-syntax v0.6.16
[INFO] [stderr]     Checking oorandom v11.1.0
[INFO] [stderr]    Compiling crossbeam-utils v0.7.2
[INFO] [stderr]    Compiling crossbeam-epoch v0.8.2
[INFO] [stderr]    Compiling num-traits v0.2.11
[INFO] [stderr]    Compiling memchr v2.3.3
[INFO] [stderr]     Checking tinytemplate v1.0.3
[INFO] [stderr]    Compiling proc-macro2 v1.0.9
[INFO] [stderr]     Checking textwrap v0.11.0
[INFO] [stderr]    Compiling semver v0.9.0
[INFO] [stderr]     Checking csv-core v0.1.10
[INFO] [stderr]     Checking clap v2.33.0
[INFO] [stderr]    Compiling quote v1.0.2
[INFO] [stderr]     Checking regex-automata v0.1.8
[INFO] [stderr]    Compiling rustc_version v0.2.3
[INFO] [stderr]     Checking crossbeam-queue v0.2.1
[INFO] [stderr]    Compiling memoffset v0.5.3
[INFO] [stderr]    Compiling cast v0.2.3
[INFO] [stderr]     Checking bstr v0.2.11
[INFO] [stderr]     Checking regex v1.3.4
[INFO] [stderr]     Checking plotters v0.2.12
[INFO] [stderr]     Checking criterion-plot v0.4.1
[INFO] [stderr]     Checking csv v1.1.3
[INFO] [stderr]     Checking crossbeam-deque v0.7.3
[INFO] [stderr]     Checking rayon-core v1.7.0
[INFO] [stderr]     Checking rayon v1.3.0
[INFO] [stderr]    Compiling serde_derive v1.0.104
[INFO] [stderr]     Checking criterion v0.3.1
[INFO] [stderr]     Checking rusty_algo_structs v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `ListNode`
[INFO] [stdout]   --> src/data_structures/linked_lists.rs:58:17
[INFO] [stdout]    |
[INFO] [stdout] 58 |     use super::{ListNode, revserse_list, build_linked_list, swap_pairs};
[INFO] [stdout]    |                 ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/data_structures/linked_lists.rs:23:18
[INFO] [stdout]    |
[INFO] [stdout] 23 | fn revserse_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                  ----^^^^
[INFO] [stdout]    |                  |
[INFO] [stdout]    |                  help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `build_linked_list`
[INFO] [stdout]  --> src/data_structures/linked_lists.rs:9:4
[INFO] [stdout]   |
[INFO] [stdout] 9 | fn build_linked_list(mut array: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `revserse_list`
[INFO] [stdout]   --> src/data_structures/linked_lists.rs:23:4
[INFO] [stdout]    |
[INFO] [stdout] 23 | fn revserse_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `swap_pairs`
[INFO] [stdout]   --> src/data_structures/linked_lists.rs:36:4
[INFO] [stdout]    |
[INFO] [stdout] 36 | fn swap_pairs(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `bubble_sort`
[INFO] [stdout]  --> src/algorithms/sorting/bubble_sort.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn bubble_sort(array: &mut Vec<i32>) {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `insertion_sort`
[INFO] [stdout]  --> src/algorithms/sorting/insertion_sort.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn insertion_sort(array: &mut Vec<i32>) {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `selection_sort`
[INFO] [stdout]  --> src/algorithms/sorting/selection_sort.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn selection_sort(array: &mut Vec<i32>) {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `merge`
[INFO] [stdout]  --> src/algorithms/sorting/merge_sort.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn merge(sub_array_1: Vec<i32>, sub_array_2: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `merge_sort`
[INFO] [stdout]   --> src/algorithms/sorting/merge_sort.rs:31:4
[INFO] [stdout]    |
[INFO] [stdout] 31 | fn merge_sort(array: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `get_row`
[INFO] [stdout]  --> src/algorithms/pascal_triangle.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn get_row(row_index: i32) -> Vec<i32> {
[INFO] [stdout]   |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 10 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/data_structures/binary_search_tree_iterative.rs:130:13
[INFO] [stdout]     |
[INFO] [stdout] 130 |         let mut bst = IterativeBinarySearchTree::new(10);
[INFO] [stdout]     |             ----^^^
[INFO] [stdout]     |             |
[INFO] [stdout]     |             help: remove this `mut`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/data_structures/binary_search_tree_iterative.rs:142:13
[INFO] [stdout]     |
[INFO] [stdout] 142 |         let mut bst = IterativeBinarySearchTree::new(10);
[INFO] [stdout]     |             ----^^^
[INFO] [stdout]     |             |
[INFO] [stdout]     |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/data_structures/binary_search_tree_iterative.rs:154:13
[INFO] [stdout]     |
[INFO] [stdout] 154 |         let mut bst = IterativeBinarySearchTree::new(10);
[INFO] [stdout]     |             ----^^^
[INFO] [stdout]     |             |
[INFO] [stdout]     |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/data_structures/binary_search_tree_iterative.rs:166:13
[INFO] [stdout]     |
[INFO] [stdout] 166 |         let mut bst = IterativeBinarySearchTree::new(10);
[INFO] [stdout]     |             ----^^^
[INFO] [stdout]     |             |
[INFO] [stdout]     |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/data_structures/binary_search_tree_iterative.rs:178:13
[INFO] [stdout]     |
[INFO] [stdout] 178 |         let mut bst = IterativeBinarySearchTree::new(10);
[INFO] [stdout]     |             ----^^^
[INFO] [stdout]     |             |
[INFO] [stdout]     |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/data_structures/linked_lists.rs:23:18
[INFO] [stdout]    |
[INFO] [stdout] 23 | fn revserse_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                  ----^^^^
[INFO] [stdout]    |                  |
[INFO] [stdout]    |                  help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/algorithms/sorting/merge_sort.rs:49:13
[INFO] [stdout]    |
[INFO] [stdout] 49 |         let mut array = vec![9, 8, 7, 6, 5, 4, 3, 2, 1];
[INFO] [stdout]    |             ----^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 8 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `ListNode`
[INFO] [stdout]   --> src/data_structures/linked_lists.rs:58:17
[INFO] [stdout]    |
[INFO] [stdout] 58 |     use super::{ListNode, revserse_list, build_linked_list, swap_pairs};
[INFO] [stdout]    |                 ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/data_structures/linked_lists.rs:23:18
[INFO] [stdout]    |
[INFO] [stdout] 23 | fn revserse_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                  ----^^^^
[INFO] [stdout]    |                  |
[INFO] [stdout]    |                  help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> src/data_structures/binary_tree.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 12 |     pub fn new(value: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `insert_left`
[INFO] [stdout]   --> src/data_structures/binary_tree.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 |     fn insert_left(&mut self, value: Option<i32>) -> () {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `insert_right`
[INFO] [stdout]   --> src/data_structures/binary_tree.rs:42:8
[INFO] [stdout]    |
[INFO] [stdout] 42 |     fn insert_right(&mut self, value: Option<i32>) -> () {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `insert`
[INFO] [stdout]   --> src/data_structures/binary_tree.rs:60:12
[INFO] [stdout]    |
[INFO] [stdout] 60 |     pub fn insert(&mut self, value: Option<i32>) -> () {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `inorder_traverse`
[INFO] [stdout]   --> src/data_structures/binary_tree.rs:72:12
[INFO] [stdout]    |
[INFO] [stdout] 72 |     pub fn inorder_traverse(&self) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `preorder_traverse`
[INFO] [stdout]   --> src/data_structures/binary_tree.rs:82:12
[INFO] [stdout]    |
[INFO] [stdout] 82 |     pub fn preorder_traverse(&self) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `postorder_traverse`
[INFO] [stdout]   --> src/data_structures/binary_tree.rs:92:12
[INFO] [stdout]    |
[INFO] [stdout] 92 |     pub fn postorder_traverse(&self) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> src/data_structures/binary_search_tree.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 15 |     pub fn new(value: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `insert`
[INFO] [stdout]   --> src/data_structures/binary_search_tree.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 26 |     pub fn insert(&mut self, value: i32) -> () {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `inorder`
[INFO] [stdout]   --> src/data_structures/binary_search_tree.rs:45:12
[INFO] [stdout]    |
[INFO] [stdout] 45 |     pub fn inorder(&self) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `preorder`
[INFO] [stdout]   --> src/data_structures/binary_search_tree.rs:57:12
[INFO] [stdout]    |
[INFO] [stdout] 57 |     pub fn preorder(&self) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `postorder`
[INFO] [stdout]   --> src/data_structures/binary_search_tree.rs:69:12
[INFO] [stdout]    |
[INFO] [stdout] 69 |     pub fn postorder(&self) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `delete`
[INFO] [stdout]   --> src/data_structures/binary_search_tree.rs:83:12
[INFO] [stdout]    |
[INFO] [stdout] 83 |     pub fn delete(&mut self, id: i32) -> () {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `exists`
[INFO] [stdout]   --> src/data_structures/binary_search_tree.rs:98:12
[INFO] [stdout]    |
[INFO] [stdout] 98 |     pub fn exists(&self, val: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `build_bst`
[INFO] [stdout]    --> src/data_structures/binary_search_tree.rs:116:12
[INFO] [stdout]     |
[INFO] [stdout] 116 |     pub fn build_bst(array: &Vec<Option<i32>>, index: usize) -> PotentialNode {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> src/data_structures/binary_search_tree_iterative.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 15 |     pub fn new(value: i32) -> PotentialNode {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `insert`
[INFO] [stdout]   --> src/data_structures/binary_search_tree_iterative.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 24 |     pub fn insert(root: Rc<RefCell<IterativeBinarySearchTree>>, value: i32) {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `preorder`
[INFO] [stdout]   --> src/data_structures/binary_search_tree_iterative.rs:46:12
[INFO] [stdout]    |
[INFO] [stdout] 46 |     pub fn preorder(&self) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `inorder`
[INFO] [stdout]   --> src/data_structures/binary_search_tree_iterative.rs:63:12
[INFO] [stdout]    |
[INFO] [stdout] 63 |     pub fn inorder(&self) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `postorder`
[INFO] [stdout]   --> src/data_structures/binary_search_tree_iterative.rs:86:12
[INFO] [stdout]    |
[INFO] [stdout] 86 |     pub fn postorder(&self) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `bfs`
[INFO] [stdout]    --> src/data_structures/binary_search_tree_iterative.rs:104:12
[INFO] [stdout]     |
[INFO] [stdout] 104 |     pub fn bfs(&self) -> Vec<i32> {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `build_linked_list`
[INFO] [stdout]  --> src/data_structures/linked_lists.rs:9:4
[INFO] [stdout]   |
[INFO] [stdout] 9 | fn build_linked_list(mut array: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `revserse_list`
[INFO] [stdout]   --> src/data_structures/linked_lists.rs:23:4
[INFO] [stdout]    |
[INFO] [stdout] 23 | fn revserse_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `swap_pairs`
[INFO] [stdout]   --> src/data_structures/linked_lists.rs:36:4
[INFO] [stdout]    |
[INFO] [stdout] 36 | fn swap_pairs(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 25 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/data_structures/binary_search_tree_iterative.rs:130:13
[INFO] [stdout]     |
[INFO] [stdout] 130 |         let mut bst = IterativeBinarySearchTree::new(10);
[INFO] [stdout]     |             ----^^^
[INFO] [stdout]     |             |
[INFO] [stdout]     |             help: remove this `mut`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/data_structures/binary_search_tree_iterative.rs:142:13
[INFO] [stdout]     |
[INFO] [stdout] 142 |         let mut bst = IterativeBinarySearchTree::new(10);
[INFO] [stdout]     |             ----^^^
[INFO] [stdout]     |             |
[INFO] [stdout]     |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/data_structures/binary_search_tree_iterative.rs:154:13
[INFO] [stdout]     |
[INFO] [stdout] 154 |         let mut bst = IterativeBinarySearchTree::new(10);
[INFO] [stdout]     |             ----^^^
[INFO] [stdout]     |             |
[INFO] [stdout]     |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/data_structures/binary_search_tree_iterative.rs:166:13
[INFO] [stdout]     |
[INFO] [stdout] 166 |         let mut bst = IterativeBinarySearchTree::new(10);
[INFO] [stdout]     |             ----^^^
[INFO] [stdout]     |             |
[INFO] [stdout]     |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/data_structures/binary_search_tree_iterative.rs:178:13
[INFO] [stdout]     |
[INFO] [stdout] 178 |         let mut bst = IterativeBinarySearchTree::new(10);
[INFO] [stdout]     |             ----^^^
[INFO] [stdout]     |             |
[INFO] [stdout]     |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/data_structures/linked_lists.rs:23:18
[INFO] [stdout]    |
[INFO] [stdout] 23 | fn revserse_list(mut head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                  ----^^^^
[INFO] [stdout]    |                  |
[INFO] [stdout]    |                  help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 7 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0599]: no method named `insert` found for enum `Option<Rc<RefCell<IterativeBinarySearchTree>>>` in the current scope
[INFO] [stdout]  --> benches/bst_benchmark.rs:9:18
[INFO] [stdout]   |
[INFO] [stdout] 9 |         bst_iter.insert(i);
[INFO] [stdout]   |                  ^^^^^^ method not found in `Option<Rc<RefCell<IterativeBinarySearchTree>>>`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0599]: no method named `inorder` found for enum `Option<Rc<RefCell<IterativeBinarySearchTree>>>` in the current scope
[INFO] [stdout]   --> benches/bst_benchmark.rs:13:92
[INFO] [stdout]    |
[INFO] [stdout] 13 |     group.bench_with_input(BenchmarkId::new("Iterative", 2), &2, |b, _| b.iter(|| bst_iter.inorder()));
[INFO] [stdout]    |                                                                                            ^^^^^^^ method not found in `Option<Rc<RefCell<IterativeBinarySearchTree>>>`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: aborting due to 2 previous errors
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] For more information about this error, try `rustc --explain E0599`.
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `rusty_algo_structs`.
[INFO] [stderr] 
[INFO] [stderr] To learn more, run the command again with --verbose.
[INFO] [stderr] warning: build failed, waiting for other jobs to finish...
[INFO] [stdout] error[E0599]: no method named `insert` found for enum `Option<Rc<RefCell<IterativeBinarySearchTree>>>` in the current scope
[INFO] [stdout]  --> benches/bst_benchmark.rs:9:18
[INFO] [stdout]   |
[INFO] [stdout] 9 |         bst_iter.insert(i);
[INFO] [stdout]   |                  ^^^^^^ method not found in `Option<Rc<RefCell<IterativeBinarySearchTree>>>`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0599]: no method named `inorder` found for enum `Option<Rc<RefCell<IterativeBinarySearchTree>>>` in the current scope
[INFO] [stdout]   --> benches/bst_benchmark.rs:13:92
[INFO] [stdout]    |
[INFO] [stdout] 13 |     group.bench_with_input(BenchmarkId::new("Iterative", 2), &2, |b, _| b.iter(|| bst_iter.inorder()));
[INFO] [stdout]    |                                                                                            ^^^^^^^ method not found in `Option<Rc<RefCell<IterativeBinarySearchTree>>>`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: aborting due to 2 previous errors
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] For more information about this error, try `rustc --explain E0599`.
[INFO] [stdout] 
[INFO] [stderr] error: build failed
[INFO] running `Command { std: "docker" "inspect" "dd21c35bc833e7fb2aaa5e3fd2117a4a68229ffe7760ed7675db2e5b6450114c", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "dd21c35bc833e7fb2aaa5e3fd2117a4a68229ffe7760ed7675db2e5b6450114c", kill_on_drop: false }`
[INFO] [stdout] dd21c35bc833e7fb2aaa5e3fd2117a4a68229ffe7760ed7675db2e5b6450114c
